Orphan structure of the first-order Reed-Muller codes
نویسندگان
چکیده
Brualdi, R.A., N. Cai and VS. Pless, Orphan structure of the first-order Reed-Muller codes, Discrete Mathematics 102 (1991) 239-247. We investigate a method of combining two codes which we call the outer product. First-order Reed-Muller codes are outer products of a number of copies of the full binary space of length 2, and we apply our results to obtain cosets of the Reed-Muller codes which have no ancestors, that is, which are orphans.
منابع مشابه
Correctable Errors of Weight Half the Minimum Distance for the First-Order Reed-Muller Codes
The number of correctable errors of weight half the minimum distance is given for the first-order binary Reed-Muller codes. It is shown that the size of trial set, which is introduced by Helleseth et al. and can be used for a minimum distance decoding or estimating the number of uncorrectable errors, for the first-order Reed-Muller codes is at least that of minimal codewords except for small code
متن کاملPartial permutation decoding for the first-order Reed-Muller codes
Partial permutation decoding is shown to apply to the first-order Reed–Muller codes R(1,m), where m > 4 by finding s-PD-sets for these codes for 2 ≤ s ≤ 4. © 2008 Elsevier B.V. All rights reserved.
متن کاملSoft-decision decoding of Reed-Muller codes as generalized multiple concatenated codes
In this paper, we present a new soft-decision decoding algorithm for Reed-Muller codes. It is based on the GMC decoding algorithm proposed by Schnabl and Bossert [1] which interprets Reed-Muller codes as generalized multiple concatenated codes. We extend the GMC algorithm to list-decoding (L-GMC). As a result, a SDML decoding algorithm for the first order Reed-Muller codes is obtained. Moreover...
متن کاملCorrectable Errors of Weight Half the Minimum Distance Plus One for the First-Order Reed-Muller Codes
The number of correctable/uncorrectable errors of weight half the minimum distance plus one for the first-order Reed-Muller codes is determined. From a cryptographic viewpoint, this result immediately leads to the exact number of Boolean functions of m variables with nonlinearity 2m−2 + 1. The notion of larger half and trial set , which is introduced by Helleseth, Kløve, and Levenshtein to desc...
متن کاملOn the third weight of generalized Reed-Muller codes
In this paper, we study the third weight of generalized Reed-Muller codes. Using results from [6], we prove under some restrictive condition that the third weight of generalized Reed-Muller codes depends on the third weight of generalized Reed-Muller codes of small order with two variables. In some cases, we are able to determine the third weight and the third weight codewords of generalized Re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 102 شماره
صفحات -
تاریخ انتشار 1992